On the Fibonacci length of powers of dihedral groups
نویسندگان
چکیده
For a finitely generated group G = 〈A〉, where A = {a1, a2, . . . , an}, the sequence xi = ai, 1 ≤ i ≤ n, xi+n = ∏n j=1 xi+j−1, i ≥ 1, is called the Fibonacci orbit of G with respect to the generating set A, denoted FA(G). If FA(G) is periodic we call the length of the period of the sequence the Fibonacci length of G with respect to A, written LENA(G). In this paper we examine the Fibonacci lengths of Di 2m, i > 1 where D2m is the dihedral group of order 2m. 2001 Mathematics Subject Classification: 20D06
منابع مشابه
Non-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملCOMPUTATIONAL RESULTS ON FINITE P-GROUPS OF EXPONENT P2
The Fibonacci lengths of the finite p-groups have been studied by R. Dikici and co-authors since 1992. All of the considered groups are of exponent p, and the lengths depend on the celebrated Wall number k(p). The study of p-groups of nilpotency class 3 and exponent p has been done in 2004 by R. Dikici as well. In this paper we study all of the p-groups of nilpotency class 3 and exponent p2. Th...
متن کاملEnergy of Graphs, Matroids and Fibonacci Numbers
The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.
متن کاملOn the eigenvalues of Cayley graphs on generalized dihedral groups
Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$. Then the energy of $Gamma$, a concept defined in 1978 by Gutman, is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$. Also the Estrada index of $Gamma$, which is defined in 2000 by Ernesto Estrada, is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$. In this paper, we compute the eigen...
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کامل